On DOL systems with immigration

On Uniform DOL Words

We introduce the wide class of marked uniform DOL words and study their structure. The criterium of circularity of a marked uniform DOL word is given, and the subword complexity function is found for the uncircular case as well as for the circular one. The same technique is valid for a wider class of uniform DOL sequences which includes (p; 1)-Toeplitz words (see 4]).

Coupling MPARM with DOL

This report summarizes the work of coupling the MPARM cycle-accurate multi-processor simulator with the Distributed Operation Layer (DOL) system-level MPSoC development framework. The main contribution of this work is the runtime environment which enables the execution of the DOL applications on top of the MPARM simulator. The runtime environment is automatically generated in a correct-byconstr...

Ontological Blending in DOL

We introduce ontological blending as a method for combining ontologies. Compared with existing combination techniques that aim at integrating or assimilating categories and relations of thematically related ontologies, blending aims at creatively generating (new) categories and ontological definitions; this is done on the basis of input ontologies whose domains are thematically distinct but who...

On DOL Power Series over Various Semirings

On the Ehrenfeucht Conjecture for DOL Languages

— Ehrenfeucht conjectured that each language L over a finite alphabet E possesses a test set, that is a finite subset F of L such that every two morphisms on E* agreeing on each string in F also agree on each string in L. We introducé the notion of déviation of a string with respect to a language and use it to give a sufficient condition for the existence of such a test set. Moreover, we prove ...